An algorithm for fractional assignment problems
نویسندگان
چکیده
منابع مشابه
An Algorithm for Fractional Assignment Problems
In this paper, we propose a polynomial time algorithm for fractional assignment problems. The fractional assignment problem is interpreted as follows. Let G = (I; J;E) be a bipartite graph where I and J are vertex sets and E I J is an edge set. We call an edge subset X( E) an assignment if every vertex is incident to exactly one edge from X: Given an integer weight c ij and a positive integer w...
متن کاملAn Algorithm for Solving Intuitionistic Fuzzy Linear Bottleneck Assignment Problems
The linear bottleneck assignment problem (LBAP), which is a variation of the classical assignment problem, seeks to minimize the longest completion time rather than the sum of the completion times when a number of jobs are to be assigned to the same number of workers. If the completion times are not certain, then it is said to be a fuzzy LBAP. Here we propose a new algorithm to solve fuzzy LBAP...
متن کاملAn Algorithm for Two Dimensional Cutting Stock Problems with Demand
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
متن کاملAn Algorithm for Two Dimensional Cutting Stock Problems with Demand
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)00094-g